Language complexity - PDFSEARCH.IO - Document Search Engine

Language complexity
Results: 256

#	Item
221	From Intelligent Design to BioLogos www.BioLogos.org BY DENNIS VENEMA For those familiar with my work here at BioLogos, it might come as a surprise to know that until Add to Reading List Source URL: biologos.org Language: English - Date: 2012-03-27 15:31:41 Creationist objections to evolution Intelligent design movement Denialism Discovery Institute campaigns Michael Behe Theistic evolution The Language of God: A Scientist Presents Evidence for Belief Irreducible complexity Objections to evolution Intelligent design Creationism Religion
222	T H E SYSTEMS THINKER ® Add to Reading List Source URL: www.groupjazz.com Language: English - Date: 2012-03-13 22:05:55 Knowledge Systems Cybernetics Complex systems theory Holism Complex adaptive system Complex systems Complexity Pattern language Science Systems theory Structure
223	StateWORKS: The Silver Bullet at last ? “Not only are there no silver bullets now in view, the very nature of software makes it unlikely that there will be any — no inventions that will do for software productivity, Add to Reading List Source URL: www.stateworks.com Language: English - Date: 2009-04-02 14:04:45 Automata theory Finite-state machine Software development process Complexity Software Application software Unified Modeling Language Shlaer–Mellor method Science Software engineering Ethology
224	RFF: A Robust, FF-Based MDP Planning Algorithm for Generating Policies with Low Probability of Failure Florent Teichteil-K¨onigsbuch and Guillaume Infantes Ugur Kuter Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2008-09-15 10:48:04 Randomness Complexity classes Probabilistic complexity theory Quantum complexity theory Automated planning and scheduling Algorithm Planning Domain Definition Language Monte Carlo method SL Theoretical computer science Computational complexity theory Applied mathematics
225	Monotonicity has only a relative effect on the complexity of quantifier verification Jakub Szymanik∗ and Marcin Zajenkowski† 1 Institute for Logic, Language and Computation Add to Reading List Source URL: www.illc.uva.nl Language: English - Date: 2013-12-13 13:15:40 Quantification Predicate logic Semantics Finite model theory Philosophical logic Generalized quantifier FO Sentence Model theory Logic Mathematical logic Theoretical computer science
226	Quantiers in TIME and SPACE Computational Complexity of Generalized Quantiers in Natural Language Jakub Szymanik Add to Reading List Source URL: www.jakubszymanik.com Language: English - Date: 2011-03-21 08:58:36 Science Mathematical logic Institute for Logic Language and Computation Computational complexity theory Complexity Algorithm Descriptive complexity theory EXPTIME P Applied mathematics Complexity classes Mathematics
227	Using intrinsic complexity of turn-taking games to predict participants’ reaction times Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Ben Meijering (b Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-19 07:51:46 Mathematics Backward induction Solution concept Reason Extensive-form game Minimax Inductive reasoning Marble Cognitive science Game theory Science Knowledge
228	Automata and Complexity in Multiple-Quantifier Sentence Verification Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Shane Steinert-Threlkeld (Shanest@stanford. Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-05-20 06:27:06 Science Automata theory Quantification Models of computation Formal languages Generalized quantifier Pushdown automaton Cognitive science Finite-state machine Logic Mathematical logic Semantics
229	Monotonicity has only a relative effect on the complexity of quantifier verification Jakub Szymanik∗ and Marcin Zajenkowski† 1 Institute for Logic, Language and Computation Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-11-29 06:14:30 Quantification Predicate logic Semantics Finite model theory Philosophical logic Generalized quantifier FO Sentence Model theory Logic Mathematical logic Theoretical computer science
230	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-13 09:14:28 Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science Graph theory Mathematics